373A - Collecting Beats is Fun - CodeForces Solution

implementation *900

Please click on ads to support us..

Python Code: 

k = int(input())
d = {1:0,2:0,3:0,4:0,5:0,6:0,7:0,8:0,9:0}
flag = True
for i in range(4):
    s = input()
    for i in s:
        if i == ".":
            continue
        else:
            
            i = int(i)
            d[i]+=1

for s,v in d.items():

    if v > (2*k):
        print("NO")
        flag = False
        break
if flag:
    print("YES")

C++ Code: 

#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>

using namespace std;



int main()
{
    int k, times[10] = { 0 };
    cin >> k;
    char a[4][4];
    bool possible = true;
    for (int i = 0; i < 4; i++)
    {
        for (int j = 0; j < 4; j++)
        {
            cin >> a[i][j];
            if (a[i][j] == '.')
                continue;
            int digit = a[i][j] - '0';
            times[digit]++;
            if (times[digit] > 2 * k)
                possible = false;
        }
    }
    if (possible)
        cout << "YES";
    else
        cout << "NO";
    return 0;
}


Comments

Submit
0 Comments
More Questions

145. Binary Tree Postorder Traversal
94. Binary Tree Inorder Traversal
101. Symmetric Tree
77. Combinations
46. Permutations
226. Invert Binary Tree
112. Path Sum
1556A - A Variety of Operations
136. Single Number
169. Majority Element
119. Pascal's Triangle II
409. Longest Palindrome
1574A - Regular Bracket Sequences
1574B - Combinatorics Homework
1567A - Domino Disaster
1593A - Elections
1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians